A novel matching formulation for startup costs in unit commitment
نویسندگان
چکیده
منابع مشابه
A Novel Matching Formulation for Startup Costs in Unit Commitment
We present a novel formulation for startup cost computation in the unit commitment problem (UC). Both the proposed formulation and existing formulations in the literature are placed in a formal, theoretical dominance hierarchy based on their respective linear programming relaxations. The proposed formulation is tested empirically against existing formulations on large-scale unit commitment inst...
متن کاملStochastic power generation unit commitment in electricity markets: a novel formulation and comparison of solution methods
We propose a stochastic unit commitment model for a power generation company that takes part in an electricity spot market. The relevant feature of this model is its detailed representation of the spot market during a whole week, including seven day-ahead market sessions and the corresponding adjustment market sessions. The adjustment market sessions can be seen as an hour-ahead market mechanis...
متن کاملMIP Formulation Improvement for Large Scale Security Constrained Unit Commitment
As a part of the day-ahead market clearing process, Midcontinent Independent System Operator (MISO) solves one of the largest and most challenging Security Constrained Unit Commitment (SCUC) models. Better computational performance of SCUC models not only improves the market efficiency but also facilitates future market development. This paper introduces two developments on Mixed Integer Progra...
متن کاملAn Improved MIP Formulation for the Unit Commitment Problem
In this paper, we present an MIP formulation for the Unit Commitment problem that leads to significant computational time savings and almost-integral solutions when compared to the state-of-the-art formulations in the literature. Using a variety of test instances from the literature, we provide empirical evidence that the polyhedral structure of the new formulation is tighter than the polyhedra...
متن کاملA Linear Programming Formulation of the Unit Commitment Problem
I show how the unit commitment problem may be recast to a jobscheduling problem amenable to a linear programming solution. While this will require a much larger memory footprint than an equivalent mixed integer programming model, I hope to show that the LP approach lead to both faster time-to-solution and greater numerical stability. 1 The Unit Commitment Problem At its most basic, the unit com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming Computation
سال: 2020
ISSN: 1867-2949,1867-2957
DOI: 10.1007/s12532-020-00176-5